Zero-knowledge universal lossless data compression
نویسندگان
چکیده
منابع مشابه
Universal lossless data compression algorithms
4 Improved compression algorithm based on the Burrows–Wheeler transform 61 4.1 Modifications of the basic version of the compression algorithm. 61 5 Conclusions 141 iii Acknowledgements 145 Bibliography 147 Appendices 161 A Silesia corpus 163 B Implementation details 167 C Detailed options of examined compression programs 173 D Illustration of the properties of the weight functions 177 E Detail...
متن کاملUniversal True Lossless Combinatorial Data Compression
Contemporary approaches to data compression vary in time delay or impact on application performance as well as in the amount of compression and loss of data. The very best modern lossless data compression algorithms use standard approaches and are unable to match spacetime high end requirements for mission critical application, with full information conservation (a few pixels may vary by com/de...
متن کاملStructured Grammar-based Codes for Universal Lossless Data Compression∗
A grammar-based code losslessly compresses each finite-alphabet data string x by compressing a context-free grammar Gx which represents x in the sense that the language of Gx is {x}. In an earlier paper, we showed that if the grammar Gx is a type of grammar called irreducible grammar for every data string x, then the resulting grammar-based code has maximal redundancy/sample O(log log n/ log n)...
متن کاملUniversal Lossless Data Compression Via Binary Decision Diagrams
A binary string of length 2 induces the Boolean function of k variables whose Shannon expansion is the given binary string. This Boolean function then is representable via a unique reduced ordered binary decision diagram (ROBDD). The given binary string is fully recoverable from this ROBDD. We exhibit a lossless data compression algorithm in which a binary string of length a power of two is com...
متن کاملUniversal lossless compression via multilevel pattern matching
A universal lossless data compression code called the multilevel pattern matching code (MPM code) is introduced. In processing a finite-alphabet data string of length , the MPM code operates at (log log ) levels sequentially. At each level, the MPM code detects matching patterns in the input data string (substrings of the data appearing in two or more nonoverlapping positions). The matching pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201712503002